IP models for round robin tournaments

نویسندگان

  • Dirk Briskorn
  • Andreas Drexl
چکیده

Generally speaking in sports competition a number of teams play against each other over a period of time according to a certain scheme. The round robin scheme is very popular in many team sports like soccer and basketball. In this paper we study several basic variants of round robin tournaments. Additionally, we examine real world issues that have to be considered when constructing a sports league schedule. We consider constraints imposed by third parties such as security aspects and legal requirements. Moreover, we analyze constraints aiming at attractive and fair sports league schedules. Throughout this paper integer programming models are the means to formally define what the particular problem under consideration is all about. Moreover, the standard solver Cplex is used in order to compute optimal solutions for smallto medium-size instances. Computational results indicate which particular constraint to relax in order to come up with acceptable schedules in reasonable time. 2007 Elsevier Ltd. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Brother Avoiding Round Robin Doubles Tournaments II

We investigate brother avoiding round robin doubles tournaments and construct several infinite families. We show that there is a BARRDT(n) that is not a SAMDRR(n) for all n > 4.

متن کامل

Round robin tournaments and three index assignments

Scheduling a sports league can be seen as a difficult combinatorial optimization problem. We study some variants of round robin tournaments and analyze the relationship with the planar three-index assignment problem. The complexity of scheduling a minimum cost round robin tournament is established by a reduction from the planar three-index assignment problem. Furthermore, we introduce integer p...

متن کامل

An Evaluation of Ranking Methods for Multiple Incomplete Round-robin Tournaments

We investigate the ability of various methods to reveal the true ranking of players competing in multiple incomplete round-robin tournaments, which arise when not all tournament competitions are held. Statistical and graphical analyses in this simulation-based study reveal that a method based on players' average winning percentages is usually best.

متن کامل

Lagrange Relaxation and Constraint Programming Collaborative schemes for Traveling Tournament Problems

This paper presents a study of hybrid algorithms combining Lagrange relaxation and constraint programming on a problem combining round-robin assignment and travel optimization. Traveling Tournament Problems (TTP) have been identified a year ago as very hard problems requiring combinations from techniques of Operations Research (OR) and Constraint Programming (CP). Indeed, constrained round robi...

متن کامل

Round-robin tournaments with homogeneous rounds

We study round-robin tournaments for n teams, where in each round a fixed number (g) of teams is present and each team present plays a fixed number (m) of matches in this round. In the tournament each match between two teams is either played once or twice, in the latter case in different rounds. We give necessary combinatorial conditions on the triples (n, g,m) for which such round-robin tourna...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computers & OR

دوره 36  شماره 

صفحات  -

تاریخ انتشار 2009